<title>二叉树遍历</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cm">/*</span>
<span class="pl-cm">DBEAC</span>
<span class="pl-cm">ABCDE</span>
<span class="pl-cm">*/</span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;string&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define CUT(x,a,b) (x.substr(a,b-a))</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-kt">void</span> <span class="pl-nf">f</span><span class="pl-p">(</span><span class="pl-n">string</span> <span class="pl-n">ms</span><span class="pl-p">,</span><span class="pl-n">string</span> <span class="pl-n">cs</span><span class="pl-p">){</span>
	<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-o">==</span><span class="pl-s">&quot;&quot;</span><span class="pl-p">)</span><span class="pl-k">return</span><span class="pl-p">;</span>
	<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">.</span><span class="pl-n">size</span><span class="pl-p">()</span><span class="pl-o">==</span><span class="pl-mi">1</span><span class="pl-p">){</span>
		<span class="pl-n">cout</span><span class="pl-o">&lt;&lt;</span><span class="pl-n">ms</span><span class="pl-p">;</span>
	<span class="pl-p">}</span><span class="pl-k">else</span><span class="pl-p">{</span>
		<span class="pl-n">string</span> <span class="pl-n">root</span><span class="pl-o">=</span><span class="pl-n">CUT</span><span class="pl-p">(</span><span class="pl-n">cs</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-mi">1</span><span class="pl-p">);</span>
		<span class="pl-kt">int</span> <span class="pl-n">ri</span><span class="pl-o">=</span><span class="pl-n">ms</span><span class="pl-p">.</span><span class="pl-n">find</span><span class="pl-p">(</span><span class="pl-n">root</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">);</span>
		<span class="pl-n">string</span> <span class="pl-n">left_cs</span><span class="pl-p">,</span><span class="pl-n">right_cs</span><span class="pl-p">,</span><span class="pl-n">left_ms</span><span class="pl-o">=</span><span class="pl-n">CUT</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">,</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-n">ri</span><span class="pl-p">),</span><span class="pl-n">right_ms</span><span class="pl-o">=</span><span class="pl-n">CUT</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">,</span><span class="pl-n">ri</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">ms</span><span class="pl-p">.</span><span class="pl-n">size</span><span class="pl-p">());</span>
		<span class="pl-kt">bool</span> <span class="pl-n">hash_left</span><span class="pl-p">[</span><span class="pl-mi">128</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{},</span><span class="pl-n">hash_right</span><span class="pl-p">[</span><span class="pl-mi">128</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{};</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">ri</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">hash_left</span><span class="pl-p">[</span><span class="pl-kt">int</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">ri</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-kt">int</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">.</span><span class="pl-n">size</span><span class="pl-p">());</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span><span class="pl-n">hash_right</span><span class="pl-p">[</span><span class="pl-kt">int</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])]</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
		<span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-kt">int</span><span class="pl-p">(</span><span class="pl-n">cs</span><span class="pl-p">.</span><span class="pl-n">size</span><span class="pl-p">());</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
			<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">hash_left</span><span class="pl-p">[</span><span class="pl-kt">int</span><span class="pl-p">(</span><span class="pl-n">cs</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])])</span><span class="pl-n">left_cs</span><span class="pl-o">+=</span><span class="pl-n">cs</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
			<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">hash_right</span><span class="pl-p">[</span><span class="pl-kt">int</span><span class="pl-p">(</span><span class="pl-n">cs</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])])</span><span class="pl-n">right_cs</span><span class="pl-o">+=</span><span class="pl-n">cs</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
		<span class="pl-p">}</span>
		<span class="pl-c1">//cout&lt;&lt;&quot;\nms:&quot;&lt;&lt;ms&lt;&lt;&quot; cs:&quot;&lt;&lt;cs&lt;&lt;&quot; left_ms:&quot;&lt;&lt;left_ms&lt;&lt;&quot; right_ms:&quot;&lt;&lt;right_ms&lt;&lt;&quot; left_cs:&quot;&lt;&lt;left_cs&lt;&lt;&quot; right_cs:&quot;&lt;&lt;right_cs&lt;&lt;endl;</span>
		<span class="pl-n">cout</span><span class="pl-o">&lt;&lt;</span><span class="pl-n">root</span><span class="pl-p">;</span>
		<span class="pl-n">f</span><span class="pl-p">(</span><span class="pl-n">left_ms</span><span class="pl-p">,</span><span class="pl-n">left_cs</span><span class="pl-p">);</span>
		<span class="pl-n">f</span><span class="pl-p">(</span><span class="pl-n">right_ms</span><span class="pl-p">,</span><span class="pl-n">right_cs</span><span class="pl-p">);</span>
	<span class="pl-p">}</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;flist.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;flist.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
	<span class="pl-n">string</span> <span class="pl-n">ms</span><span class="pl-p">,</span><span class="pl-n">cs</span><span class="pl-p">;</span>
	<span class="pl-n">cin</span><span class="pl-o">&gt;&gt;</span><span class="pl-n">ms</span><span class="pl-o">&gt;&gt;</span><span class="pl-n">cs</span><span class="pl-p">;</span>
	<span class="pl-n">f</span><span class="pl-p">(</span><span class="pl-n">ms</span><span class="pl-p">,</span><span class="pl-n">cs</span><span class="pl-p">);</span>
	<span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>